/**
*      author: Y_Yao
*      created: 2025-04-07 14:19:58
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 9e18;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 7;
int n,q;
int a[N];
int sum[N];

void solve()
{
    cin >> n >> q;
    int mx = -INF;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        mx = max(mx,a[i]);
    }
    for(int i = 1;i <= n;i++)
    {
        sum[i] = sum[i-1] + (a[i] - a[i-1] - 1);
    }
    while(q--)
    {
        int k;
        cin >> k;
        auto it = lower_bound(sum + 1,sum + 1 + n,k) - sum - 1;
        cout << a[it] + k - sum[it] << endl;
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}